An improved dynamic cooperative random drift particle swarm optimization algorithm based on search history decision
نویسندگان
چکیده
منابع مشابه
Random Drift Particle Swarm Optimization
The random drift particle swarm optimization (RDPSO) algorithm, inspired by the free electron model in metal conductors placed in an external electric field, is presented, systematically analyzed and empirically studied in this paper. The free electron model considers that electrons have both a thermal and a drift motion in a conductor that is placed in an external electric field. The motivatio...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملAn Improved Particle Swarm Optimization Algorithm based on Membrane Structure
Presented a new hybrid particle swarm algorithm based on P systems, through analyzing the working principle and improved strategy of the elementary particle swarm algorithm. Used the particles algorithm combined with the membrane to form a community, particles use wheel-type structure to communicate the current best particle within the community. The best particles, as Representative, compete f...
متن کاملAn Improved Adaptive Dynamic Particle Swarm Optimization Algorithm
In order to overcome the weakness that particle swarm optimization algorithm is likely to fall into local minimum when the complex optimization problems are solved, a new adaptive dynamic particle swarm optimization algorithm is proposed. The paper introduces the evaluation index of particle swarm premature convergence to judge the state of particle swarm in the population space, for the sake o...
متن کاملAn Improved Probability Particle Swarm Optimization Algorithm
This paper deals with the problem of unconstrained optimization. An improved probability particle swarm optimization algorithm is proposed. Firstly, two normal distributions are used to describe the distributions of particle positions, respectively. One is the normal distribution with the global best position as mean value and the difference between the current fitness and the global best fitne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2020
ISSN: 1748-3026,1748-3026
DOI: 10.1177/1748302620973537